On definite program answers and least Herbrand models
نویسنده
چکیده
A sufficient and necessary condition is given under which least Herbrand models exactly characterize the answers of definite clause programs.
منابع مشابه
Declarative semantics of a meta-programming language?
We present a logical programming language, generative clause programs, which generalize definite clause programs with a meta-programming level. The fundamental notion in the language is that of a meta-goal which consists of a plain goal together with a program in which it is expected to be true. The declarative semantics can be defined in terms of Herbrand models consisting of such meta-goals. ...
متن کاملEvery Formula-Based Logic Program Has a Least Infinite-Valued Model
Every definite logic program has as its meaning a least Herbrand model with respect to the program-independent ordering ⊆. In the case of normal logic programs there do not exist least models in general. However, according to a recent approach by Rondogiannis and Wadge, who consider infinite-valued models, every normal logic program does have a least model with respect to a program-independent ...
متن کاملA Note on Logic Programming Fixed-Point Semantics
In this paper, we present an account of classical Logic Programming fixed-point semantics in terms of two standard categorical constructions in which the least Herbrand model is characterized by properties of universality. In particular, we show that, given a program P , the category of models of P is reflective in the category of interpretations for P . In addition, we show that the immediate ...
متن کاملThe Limits of Horn Logic Programs
Given a sequence {Πn} of Horn logic programs, the limit Π of {Πn} is the set of the clauses such that every clause in Π belongs to almost every Πn and every clause in infinitely many Πn’s belongs to Π also. The limit program Π is still Horn but may be infinite. In this paper, we consider if the least Herbrand model of the limit of a given Horn logic program sequence {Πn} equals the limit of the...
متن کاملTransforming Normal Programs by Replacement
The replacement transformation operation, already defined in [28], is studied wrt normal programs. We give applicability conditions able to ensure the correctness of the operation wrt Fitting's and Kunen's semantics. We show how replacement can mimic other transformation operations such as thinning, fattening and folding, thus producing applicability conditions for them too. Furthermore we char...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- TPLP
دوره 16 شماره
صفحات -
تاریخ انتشار 2016